package solution;

/**
 * @author : wenchao.long
 * @date : Created in 2021/7/9 14:00 周五
 * @description : 二分查找
 *         数组升序
 */
public class SearchSolution {

    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return -1;
    }
}
